Further results on square sum graph

Further Results on Square Sum Graph

A (p, q) graph G is said to be square sum, if there exists a bijection f : V (G) → {0, 1, 2, . . . , p − 1} such that the induced function f∗ : E(G)→ N defined by f∗(uv) = (f(u))2 + (f(v))2, for every uv ∈ E(G) is injective. In this paper we establish that if G is a square sum graph then G∪Pm is square sum, (Km,n) is square sum if and only if m+n ≤ 5 and W 2 n is square sum if and only if n ≤ 5...

Further results on the eccentric distance sum

The eccentric distance sum (EDS) is a novel graph invariant which can be used to predict biological and physical properties, and has a vast potential in structure activity/property relationships. For a connected graph G, its EDS is defined as ξ d (G) = ∑ v∈V (G) ecc G (v)D G (v), where ecc G (v) is the eccentricity of a vertex v in G and D G (v) is the sum of distances of all vertices in G from...

Further results on antimagic graph labelings

Further Results on Betweenness Centrality of Graphs

Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.

Further Results on Complementary Super Edge Magic Graph Labeling

Abstract : In this paper we introduced the concept of complementary super edge magic labeling and Complementary Super Edge Magic strength of a graph G.A graph G (V, E ) is said to be complementary super edge magic if there exist a bijection f:V U E → { 1, 2, ............p+q } such that p+q+1 f(x) is constant. Such a labeling is called complementary super edge magic labeling with complementary s...